Tree Unification Grammar

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synchronous Tree Unification Grammar

This paper presents a novel grammar formalism, Synchronous Tree Unification Grammar (STUG), that borrows ideas from two rather distinct exemplars of tree-based grammar formalisms, namely Synchronous Tree Adjoining Grammar and Tree Unification Grammar. At the same time STUG differs considerably from those in that it allows for a clean separation of syntax and valency. Exploiting this potential i...

متن کامل

Tree Unification Grammar

INTRODUCTION There is a mind in uni~ca~on-based grammar formalisms towards using a single grammar stmctme to contain the phonological, syntactic and semantic information associated with a linguistic expression. Adopting'the terminology used by Pollard and Sag (1987), this grammar structure is called a sign. Grammar rules, guided by the syntactic information contained in signs, are used to deriv...

متن کامل

Tree Unification Grammar Problems and Proposals for Topology , TAG , and

This work presents a lexicalized grammar formalism which can be seen as a variant of multi-component tree adjoining grammar (TAG). This formalism is well-suited for describing the syntax of German because it relates a syntactic dependency graph with a hierarchy of topological domains. The topological phrase structure encodes the placement of verbal and nominal elements in the (ordered) field st...

متن کامل

RUG: Regular Unification Grammar

The paper describes a new unification based grammar formalism called Regula r Unif icat ion G r a m m a r (RUG). The formalism is under development at the Research Unit of Computational Linguistics, University of Helsinki, In outline, RUG can be described as a combination of an extended graph unification formalism with a fixed minimal finite state syntax. Section I of the paper outlines the RUG...

متن کامل

Trace And Unification Grammar

This paper presents Trace & Unification Grammar (TUG), a declarative and reversible grammar formalism that brings together Unification Grammar (UG) and ideas of Government & Binding Theory (on)~ The main part of the paper consists in a description of many free word order phenomena of German syntax. It will be shown that the use of traces allows for an easier and more elegant way of description ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2004

ISSN: 1571-0661

DOI: 10.1016/s1571-0661(05)82578-2